On incidence coloring conjecture in Cartesian products of graphs
نویسندگان
چکیده
منابع مشابه
-λ coloring of graphs and Conjecture Δ ^ 2
For a given graph G, the square of G, denoted by G2, is a graph with the vertex set V(G) such that two vertices are adjacent if and only if the distance of these vertices in G is at most two. A graph G is called squared if there exists some graph H such that G= H2. A function f:V(G) {0,1,2…, k} is called a coloring of G if for every pair of vertices x,yV(G) with d(x,y)=1 we have |f(x)-f(y)|2 an...
متن کاملOn polytopality of Cartesian products of graphs
We study the polytopality of Cartesian products of non-polytopal graphs. On the one hand, we prove that a product of graphs is the graph of a simple polytope if and only if its factors are. On the other hand, we provide a general construction of polytopal products of a polytopal graph by a non-polytopal graph.
متن کاملGame coloring the Cartesian product of graphs
This article proves the following result: Let G and G′ be graphs of orders n and n′, respectively. Let G∗ be obtained from G by adding to each vertex a set of n′ degree 1 neighbors. If G∗ has game coloring number m and G′ has acyclic chromatic number k, then the Cartesian product G G′ has game chromatic number at most k(k+m − 1). As a consequence, the Cartesian product of two forests has game c...
متن کاملColoring the Cartesian sum of graphs
For graphs G and H, let G ⊕ H denote their Cartesian sum. We investigate the chromatic number and the circular chromatic number for G ⊕ H. It is proved that for any graphs G and H, χ(G ⊕ H) ≤ max{dχc(G)χ(H)e, dχ(G)χc(H)e}. It is conjectured that for any graphs G and H, χc(G ⊕H) ≤ max{χ(H)χc(G), χ(G)χc(H)}. We confirm this conjecture for graphs G and H with special values of χc(G) and χc(H). The...
متن کاملOn b-coloring of cartesian product of graphs
A b-coloring of a graph G by k colors is a proper k-coloring of the vertices of G such that in each color class there exists a vertex having neighbors in all the other k−1 color classes. The b-chromatic number φ(G) of a graph G is the maximum k for which G has a b-coloring by k colors. This concept was introduced by R.W. Irving and D.F. Manlove in 1999. In this paper we study the b-chromatic nu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2016
ISSN: 0166-218X
DOI: 10.1016/j.dam.2016.04.030